Inversion of general tridiagonal matrices
نویسندگان
چکیده
In the current work, the authors present a symbolic algorithm for finding the inverse of any general nonsingular tridiagonal matrix. The algorithm is mainly based on the work presented in [Y. Huang, W.F. McColl, Analytic inversion of general tridiagonal matrices, J. Phys. A 30 (1997) 7919–7933] and [M.E.A. El-Mikkawy, A fast algorithm for evaluating nth order tridiagonal determinants, J. Comput. Appl. Math. 166 (2004) 581–584]. It removes all cases where the numeric algorithm in [Y. Huang, W.F. McColl, Analytic inversion of general tridiagonal matrices, J. Phys. A 30 (1997) 7919–7933] fails. The symbolic algorithm is suited for implementation using Computer Algebra Systems (CAS) such as MACSYMA, MAPLE and MATHEMATICA. An illustrative example is given. c © 2005 Elsevier Ltd. All rights reserved.
منابع مشابه
On the nonnegative inverse eigenvalue problem of traditional matrices
In this paper, at first for a given set of real or complex numbers $sigma$ with nonnegative summation, we introduce some special conditions that with them there is no nonnegative tridiagonal matrix in which $sigma$ is its spectrum. In continue we present some conditions for existence such nonnegative tridiagonal matrices.
متن کاملNumerically Stable Algorithms for Inversion of Block Tridiagonal and Banded Matrices
We provide a new representation for the inverse of block tridiagonal and banded matrices. The new representation is shown to be numerically stable over a variety of block tridiagonal matrices, in addition of being more computationally efficient than the previously proposed techniques. We provide two algorithms for commonly encountered problems that illustrate the usefulness of the results.
متن کاملMatrices with banded inverses: Inversion algorithms and factorization of Gauss-Markov processes
The paper considers the inversion of full matrices whose inverses are -banded. We derive a nested inversion algorithm for such matrices. Applied to a tridiagonal matrix, the algorithm provides its explicit inverse as an element-wise product (Hadamard product) of three matrices. When related to Gauss–Markov random processes (GMrp), this result provides a closed-form factored expression for the c...
متن کاملBlock Tridiagonal Matrices in Electronic Structure Calculations
A method for the inversion of block tridiagonal matrices encountered in electronic structure calculations is developed, with the goal of efficiently determining the matrices involved in the Fisher–Lee relation for the calculation of electron transmission coefficients. The new method leads to faster transmission calculations compared to traditional methods, as well as freedom in choosing alterna...
متن کاملMatrices Which Inversions are Tridiagonal, Band or Block-Tridiagonal and Their Relationship with the Covariance Matrices of a Markov Processes
The article discusses the matrices of the 1 n A , m n A , m N A forms, whose inversions are: tridiagonal matrix 1 n A (n dimension of the matrix), banded matrix m n A (m the half-width band of the matrix) or block-tridiagonal matrix m N A (N=n x m – full dimension of the block matrix; m the dimension of the blocks) and their relationships with the covariance matrices of measurements with ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Appl. Math. Lett.
دوره 19 شماره
صفحات -
تاریخ انتشار 2006